Cyclic admissible contraction and applications to functional equations in dynamic programming
نویسندگان
چکیده
منابع مشابه
Fixed Points and Cyclic Contraction Mappings under Implicit Relations and Applications to Integral Equations
Inspired by the fact that the discontinuous mappings cannot be (Banach type) contractions and cyclic contractions need not be continuous, and taking into account that there are applications to integral and differential equations based on cyclic contractions, a new type of cyclic contraction mappings satisfying an implicit relation that involves a control function for a map in a metric space is ...
متن کاملModern Computational Applications of Dynamic Programming
Computational dynamic programming, while of some use for situations typically encountered in industrial and systems engineering, has proved to be of much greater significance in many areas of computer science. We review some of these applications here.
متن کاملSolvability and Algorithms for Functional Equations Originating from Dynamic Programming
The main purpose of this paper is to study the functional equation arising in dynamic programming of multistage decision processes f x opty∈Dopt{p x, y , q x, y f a x, y , r x, y f b x, y , s x, y f c x, y } for all x ∈ S. A few iterative algorithms for solving the functional equation are suggested. The existence, uniqueness and iterative approximations of solutions for the functional equation ...
متن کاملPartitioned Cyclic Functional Equations
We prove the generalized Hyers-Ulam-Rassias stability of a partitioned functional equation. It is applied to show the stability of algebra homomorphisms between Banach algebras associated with partitioned functional equations in Banach algebras.
متن کاملa dynamic programming solution to solute transport and dispersion equations in groundwater
the partial differential equations for water flow and solute transport in a two-dimensional saturated domain are rendered discrete using the finite difference technique; the resulting system of algebraic equations is solved using a dynamic programming (dp) method. the advantage of the dp algorithm is that the problem is converted from solving an algebraic system of order nc(nl-1) nc(nl-1) into...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2015
ISSN: 1687-1812
DOI: 10.1186/s13663-015-0410-6